#include <iostream>
#include <ctime>
#include <fstream>

using namespace std;
unsigned int st = clock();
int main()
{
    int f_n[11], k, i;
    ifstream f ("m1_sorted");
    if(f.is_open())
    {
        for (i = 0; i<11; i++)
        {
            f >> f_n[i];
            cout << f_n[i] << endl;
        }
    }

    for (int i = 0; i < 11; i++)
    {
        if (f_n[i] < f_n[i+1])
        {
            swap(f_n[i], f_n[i+1]);
            k++;
        }
        cout << f_n[i] << endl;
    }
    unsigned int ft = clock();
    return 0;
}
